// ========================================================================= //

// includes
#include "stdio.h"
#include "stdlib.h"
#include "time.h"
#include "string.h"
#include "limits.h"
#include "float.h"



#define JOTAI_NUM_RANDS_ 25

const unsigned rand_primes[JOTAI_NUM_RANDS_] = {179, 103, 479, 647, 229, 37, 271, 557, 263, 607, 18743, 50359, 21929, 48757, 98179, 12907, 52937, 64579, 49957, 52567, 507163, 149939, 412157, 680861, 757751};

int next_i() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_];
}

float next_f() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_] / 757751.0F;
} 


// Usage menu
void usage() {
    printf("%s", "Usage:\n\
    prog [ARGS]\n\
\nARGS:\n\
       0            int-bounds\n\
       1            big-arr\n\
       2            big-arr-10x\n\
       3            empty\n\
\n\
");

}


// ------------------------------------------------------------------------- //

#define NULL ((void*)0)
typedef unsigned long size_t;  // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__;  // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */
struct ra_imgfmt_desc {int num_planes; int** components; } ;

/* Variables and functions */

__attribute__((used)) static int find_comp(struct ra_imgfmt_desc *desc, int component)
{
    int cur = 0;
    for (int n = 0; n < desc->num_planes; n++) {
        for (int i = 0; i < 4; i++) {
            if (desc->components[n][i]) {
                if (desc->components[n][i] == component)
                    return cur;
                cur++;
            }
        }
    }
    return -1;
}

// ------------------------------------------------------------------------- //

int main(int argc, char *argv[]) {

    if (argc != 2) {
        usage();
        return 1;
    }

    int opt = atoi(argv[1]);
    switch(opt) {

    // int-bounds
    case 0:
    {
          int component = 100;
        
          int _len_desc0 = 1;
          struct ra_imgfmt_desc * desc = (struct ra_imgfmt_desc *) malloc(_len_desc0*sizeof(struct ra_imgfmt_desc));
          for(int _i0 = 0; _i0 < _len_desc0; _i0++) {
              desc[_i0].num_planes = ((-2 * (next_i()%2)) + 1) * next_i();
          int _len_desc__i0__components0 = 1;
          desc[_i0].components = (int **) malloc(_len_desc__i0__components0*sizeof(int *));
          for(int _j0 = 0; _j0 < _len_desc__i0__components0; _j0++) {
            int _len_desc__i0__components1 = 1;
            desc[_i0].components[_j0] = (int *) malloc(_len_desc__i0__components1*sizeof(int));
            for(int _j1 = 0; _j1 < _len_desc__i0__components1; _j1++) {
              desc[_i0].components[_j0][_j1] = ((-2 * (next_i()%2)) + 1) * next_i();
            }
          }
        
          }
        
          int benchRet = find_comp(desc,component);
          printf("%d\n", benchRet); 
          for(int _aux = 0; _aux < _len_desc0; _aux++) {
          free(*(desc[_aux].components));
        free(desc[_aux].components);
          }
          free(desc);
        
        break;
    }
    // big-arr
    case 1:
    {
          int component = 255;
        
          int _len_desc0 = 65025;
          struct ra_imgfmt_desc * desc = (struct ra_imgfmt_desc *) malloc(_len_desc0*sizeof(struct ra_imgfmt_desc));
          for(int _i0 = 0; _i0 < _len_desc0; _i0++) {
              desc[_i0].num_planes = ((-2 * (next_i()%2)) + 1) * next_i();
          int _len_desc__i0__components0 = 1;
          desc[_i0].components = (int **) malloc(_len_desc__i0__components0*sizeof(int *));
          for(int _j0 = 0; _j0 < _len_desc__i0__components0; _j0++) {
            int _len_desc__i0__components1 = 1;
            desc[_i0].components[_j0] = (int *) malloc(_len_desc__i0__components1*sizeof(int));
            for(int _j1 = 0; _j1 < _len_desc__i0__components1; _j1++) {
              desc[_i0].components[_j0][_j1] = ((-2 * (next_i()%2)) + 1) * next_i();
            }
          }
        
          }
        
          int benchRet = find_comp(desc,component);
          printf("%d\n", benchRet); 
          for(int _aux = 0; _aux < _len_desc0; _aux++) {
          free(*(desc[_aux].components));
        free(desc[_aux].components);
          }
          free(desc);
        
        break;
    }
    // big-arr-10x
    case 2:
    {
          int component = 10;
        
          int _len_desc0 = 100;
          struct ra_imgfmt_desc * desc = (struct ra_imgfmt_desc *) malloc(_len_desc0*sizeof(struct ra_imgfmt_desc));
          for(int _i0 = 0; _i0 < _len_desc0; _i0++) {
              desc[_i0].num_planes = ((-2 * (next_i()%2)) + 1) * next_i();
          int _len_desc__i0__components0 = 1;
          desc[_i0].components = (int **) malloc(_len_desc__i0__components0*sizeof(int *));
          for(int _j0 = 0; _j0 < _len_desc__i0__components0; _j0++) {
            int _len_desc__i0__components1 = 1;
            desc[_i0].components[_j0] = (int *) malloc(_len_desc__i0__components1*sizeof(int));
            for(int _j1 = 0; _j1 < _len_desc__i0__components1; _j1++) {
              desc[_i0].components[_j0][_j1] = ((-2 * (next_i()%2)) + 1) * next_i();
            }
          }
        
          }
        
          int benchRet = find_comp(desc,component);
          printf("%d\n", benchRet); 
          for(int _aux = 0; _aux < _len_desc0; _aux++) {
          free(*(desc[_aux].components));
        free(desc[_aux].components);
          }
          free(desc);
        
        break;
    }
    // empty
    case 3:
    {
          int component = ((-2 * (next_i()%2)) + 1) * next_i();
        
          int _len_desc0 = 1;
          struct ra_imgfmt_desc * desc = (struct ra_imgfmt_desc *) malloc(_len_desc0*sizeof(struct ra_imgfmt_desc));
          for(int _i0 = 0; _i0 < _len_desc0; _i0++) {
              desc[_i0].num_planes = ((-2 * (next_i()%2)) + 1) * next_i();
          int _len_desc__i0__components0 = 1;
          desc[_i0].components = (int **) malloc(_len_desc__i0__components0*sizeof(int *));
          for(int _j0 = 0; _j0 < _len_desc__i0__components0; _j0++) {
            int _len_desc__i0__components1 = 1;
            desc[_i0].components[_j0] = (int *) malloc(_len_desc__i0__components1*sizeof(int));
            for(int _j1 = 0; _j1 < _len_desc__i0__components1; _j1++) {
              desc[_i0].components[_j0][_j1] = ((-2 * (next_i()%2)) + 1) * next_i();
            }
          }
        
          }
        
          int benchRet = find_comp(desc,component);
          printf("%d\n", benchRet); 
          for(int _aux = 0; _aux < _len_desc0; _aux++) {
          free(*(desc[_aux].components));
        free(desc[_aux].components);
          }
          free(desc);
        
        break;
    }
    default:
        usage();
        break;

    }

    return 0;
}
